//
// Source code recreated from a .class file by IntelliJ IDEA
// (powered by FernFlower decompiler)
//

package 力扣.题库.未分类;

public class demo_1295 {
    public demo_1295() {
    }

    public int findNumbers(int[] nums) {
        int count = 0;

        for(int num : nums) {
            if ((new StringBuilder()).append(num).length() % 2 == 0) {
                ++count;
            }
        }

        return count;
    }
}
